Diameter, Covering Index, Covering Radius and Eigenvalues
نویسندگان
چکیده
منابع مشابه
Dynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملCovering and radius-covering arrays: Constructions and classification
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays,...
متن کاملMinimum-diameter covering problems
A set V and a collection of (possibly non-disjoint) subsets are given. Also given is a real matrix describing distances between elements of V. A cover is a subset of V containing at least one representative from each subset. The multiple-choice minimum diameter problem is to select a cover of minimum diameter. The diameter is deened as the maximum distance of any pair of elements in the cover. ...
متن کاملdynamic hub covering problem with flexible covering radius
abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...
متن کاملOn the Covering Radius Problem for Codes I . Bounds on Normalized Covering Radius
In this two-part paper we introduce the notion of a stable code and give a new upper bound on the normalized covering radius ofa code. The main results are that, for fixed k and large n, the minimal covering radius t[n, k] is realized by a normal code in which all but one of the columns have multiplicity l; hence tin + 2, k] t[n, k] + for sufficiently large n. We also show that codes with n _-<...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1991
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(13)80076-5